SIGNED MULTIPLICATION USING QUAD PAIR RECODING

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient canonic signed digit recoding

In this work novel-efficient implementations to convert a two’s complement binary number into its canonic signed digit (CSD) representation are presented. In these CSD recoding circuits two signals, H and K, functionally equivalent to two carries are described. They are computed in parallel reducing the critical path and they possess some properties that lead to a simplification of the algebrai...

متن کامل

Multiplication of Signed-digit Numbers

A recently proposed technique for common-multiplicand multiplication of binary numbers is shown to be applicable to signed-digit numbers. We prove that multiplication of a single k-bit multiplicand by n k-bit multipliers can be performed using 0:306nk additions for canonically recoded signed-digit numbers, while the binary case requires 0:375nk additions.

متن کامل

Optical multiplication and division using modified -signed -digit symbolic substitution

CONTENTS 1. Introduction 2. Symbolic substitution (SS) rules for modified-signed-digit (MSD) addition and subtraction 3. Optical implementation of SS rules 4. Parallel MSD multiplication 4.1. MSD multiplication algorithm 4.2. Optical implementation of the MSD multiplication 5. MSD convergence division 6. Conversion between binary and MSD representations 6.1. From binary code to MSD code 6.2. Fr...

متن کامل

Enhanced Doubling Attacks on Signed-All-Bits Set Recoding

In cryptographic devices like a smart card whose computing ability and memory are limited, cryptographic algorithms should be performed efficiently. However, the issue of efficiency sometimes raises vulnerabilities against side channel attacks (SCAs). In elliptic curve cryptosystems, one of main operations is the scalar multiplication. Thus it must be constructed in safety against SCAs. Recentl...

متن کامل

Optimal Left-to-Right Binary Signed-Digit Recoding

This paper describes new methods for producing optimal binary signed-digit representations. This can be useful in the fast computation of exponentiations. Contrary to existing algorithms, the digits are scanned from left to right (i.e., from the most significant position to the least significant position). This may lead to better performances in both hardware and software.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Engineering Applied Sciences and Technology

سال: 2020

ISSN: 2455-2143

DOI: 10.33564/ijeast.2020.v04i12.080